An order-sorted resolution in theory and practice
نویسندگان
چکیده
منابع مشابه
Higher-Order Order-Sorted Resolution
The introduction of sorts to rst-order automated deduction has brought greater conciseness of representation and a considerable gain in eeciency by reducing the search space. It is therefore promising to treat sorts in higher order theorem proving as well. In this paper we present a generalization of Huet's Constrained Resolution to an order-sorted type theory T with term declarations. This sys...
متن کاملOrder-Sorted Feature Theory Unification
Order-sorted feature (OSF) terms provide an adequate representation for objects as flexible records. They are sorted, attributed, possibly nested, structures, ordered thanks to a subsort ordering. Sort definitions offer the functionality of classes imposing structural constraints on objects. These constraints involve variable sorting and equations among feature paths, including self-reference. ...
متن کاملAn E cient Constraint Language for Polymorphic Order-sorted Resolution
In recent years various sorted logics have been developed, mostly to facilitate knowledge representation and to speed up automated deduction. We present a polymorphic order-sorted logic that can be implemented e ciently. Because the polymorphism is almost unrestricted, it is possible for two terms to have an exponential number of maximally general uni ers. To guarantee a single most general uni...
متن کاملAn Order-Sorted Resolution with Implicitly Negative Sorts
We usually use natural language vocabulary for sort names in order-sorted logics, and some sort names may contradict other sort names in the sort-hierarchy. These implicit negations, called lexical negations in linguistics, are not explicitly prefixed by the negation connective. In this paper, we propose the notions of structured sorts, sort relations, and the contradiction in the sort-hierarch...
متن کاملAn Order Theory Resolution Calculus
In this paper we present an ordered theory resolution calculus and prove its completeness. Theory reasoning means to relieve a calculus from explicitly drawing inferences in a given theory by special purpose inference rules (e.g. E-resolution for equality reasoning). We take advantage of orderings (e.g. simplification orderings) by disallowing to resolve upon clauses which violate certain maxim...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1997
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(97)00051-0